Common parallelization strategy of topological operators on SMP machines

نویسندگان

  • Ramzi MAHMOUDI
  • Mohamed AKIL
چکیده

....................................................................................................................................................... 3 RÉSUMÉ ............................................................................................................................................................. 4 ACKNOWLEDGEMENTS / REMERCIEMENTS ............................................................................................ 5 PUBLICATIONS ................................................................................................................................................ 6 CONTENTS ........................................................................................................................................................ 8 LIST OF FIGURES ........................................................................................................................................... 10 LIST OF TABLES ............................................................................................................................................ 11 LIST OF DEFINITIONS ................................................................................................................................... 12 LIST OF ALGORITHMS ................................................................................................................................. 13 INTRODUCTION ............................................................................................................................................. 14 1.1 Context and motivations .................................................................................................................... 14 1.2 Contributions ..................................................................................................................................... 15 1.3 Report organization ........................................................................................................................... 17 PARALLELIZATION STRATEGY ................................................................................................................. 18 2.1 Lack of common parallelization strategy for topological operators .................................................. 19 2.2 Fundamental basis for parallelization ................................................................................................ 19 2.3 Classification of SD&M strategy ...................................................................................................... 22 2.4 SD&M strategy conception ............................................................................................................... 23 2.4.1 The splitting phase ..................................................................................................................... 24 2.4.2 Distribution phase ...................................................................................................................... 27 2.4.3 The Merging phase .................................................................................................................... 34 2.5 Conclusion ......................................................................................................................................... 36 TOPOLOGICAL WATERSHED...................................................................................................................... 37 3.1 Watershed transformations ................................................................................................................ 37 3.1.1 Watershed based on flooding .................................................................................................... 39 3.1.2 Watershed based on path-cost minimization ............................................................................. 42 3.1.3 Topological watershed ............................................................................................................... 47 3.1.4 Watershed transform based on local condition .......................................................................... 50 3.1.5 Watershed transform based on minimum spanning forest......................................................... 52 3.2 Classification of watershed algorithms .............................................................................................. 54 3.3 Construction of parallel topological watershed ................................................................................. 55 3.3.1 Basic notions and definitions ..................................................................................................... 56 3.3.2 Parallel stream computing ......................................................................................................... 57 pa st el -0 06 80 73 5, v er si on 1 20 M ar 2 01 2

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real time image processing : algorithm parallelization on multicore multithread architecture. (Imagerie temps réel : parallélisation d'algorithmes sur plate-forme multi-processeurs)

....................................................................................................................................................... 3 RÉSUMÉ ............................................................................................................................................................. 4 ACKNOWLEDGEMENTS / REMERCIEMENTS ..............................................

متن کامل

A methodology for detailed performance modeling of reduction computations on SMP machines

In this paper, we revisit the problem of performance prediction on SMP machines, motivated by the need for selecting parallelization strategy for random write reductions. Such reductions frequently arise in data mining algorithms. In our previous work, we have developed a number of techniques for parallelizing this class of reductions. Our previous work has shown that each of the three techniqu...

متن کامل

Experiments with Cholesky Factorization on Clusters of SMPs

Cholesky factorization of large dense matrices is an integral part of many applications in science and engineering. In this paper we report on experiments with different parallel versions of Cholesky factorization on modern high-performance computing architectures. For the parallelization of Cholesky factorization we utilized various standard linear algebra software packages and present perform...

متن کامل

Real-time topological image smoothing on shared memory parallel machines

Smoothing filter is the method of choice for image preprocessing and pattern recognition. We present a new concurrent method for smoothing 2D object in binary case. Proposed method provides a parallel computation while preserving the topology by using homotopic transformations. We introduce an adapted parallelization strategy called split, distribute and merge (SDM) strategy which allows effici...

متن کامل

A Parallel Evolutionary Algorithm for Discovery of Decision Rules

In the paper a new parallel method for learning decision rules is proposed. The method uses evolutionary algorithm to discover decision rules from datasets. We describe a parallelization of the algorithm based on master-slave model. In our approach the dataset is distributed among slave processors of a parallel system. The slave procesors compute fitness function of chromosomes in parallel. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011